Description: 最佳调度问题，假设有n个任务由k个可并行工作的机器完成。完成任务i需要的时间为ti。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。
-Optimal scheduling problem, assuming that n has a mission by the k-parallel machine to complete the work. I need to complete the mission time for ti. Try to design an algorithm to find n complete this task the best scheduling, making the time to complete a full first mission. Platform: |
Size: 1024 |
Author:朱亚华 |
Hits:
Description: 解决了并行机调度问题，本题采用穷举法与随机法相结合的方法求解，可取得最优解。-Solve the parallel machine scheduling problem, the problem using exhaustive method, the optimal solution can be achieved. Platform: |
Size: 1024 |
Author:langlang |
Hits:
Description: 假设有n个任务由k个可并行工作的机器完成。完成任务i需要时间为Ti。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。
-Suppose there are n-task by the k-parallel machine can be completed. I need time to complete the task Ti. Try to design an algorithm to find completing these n-best task scheduling, making the earliest time to complete all tasks. Platform: |
Size: 1024 |
Author:孙云 |
Hits:
Description: 调度问题的回溯算法，算法中的经典问题。问题描述：假设有n个任务由k个可并行工作的机器完成。完成任务i需要的时间为ti。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。-Scheduling problem backtracking algorithm is the classic problem. Problem Description: Suppose there are n-task by the k-parallel machine can be completed. The time required to complete the task i is ti. Try to design an algorithm to find completing these n-best task scheduling, making the earliest time to complete all tasks. Platform: |
Size: 16384 |
Author:pactric |
Hits:
Description: Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective Platform: |
Size: 129024 |
Author:魏明 |
Hits:
Description: 最佳调度问题，假设有n个任务由k个可并行工作的机器完成。完成任务i需要的时间为ti。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。-Optimal scheduling problem, assuming there are n a task by the k-parallel machine can be completed. The time required to complete the task i is ti. Try to design a complete algorithm to find the optimal scheduling of tasks n, make the time to complete all tasks first. Platform: |
Size: 1024 |
Author:李晓明 |
Hits:
Description: The basic structure of the book has not been changed in this new edition.
The book still consists of three parts and a string of Appendixes. However,
several chapters have been extended in a meaningful way, covering additional
topics that have become recently of interest. Some of the new topics are more
methodological, whereas others represent new classes of models.
The more methodological aspects that are receiving more attention include
Polynomial Time Approximation Schemes (PTAS) and Constraint Programming.
These extensions involve new material in the regular chapters as well as
in the Appendixes. Since the field of online scheduling has received an enormous
amount of attention in recent years, a section focusing on online scheduling has
been added to the chapter on parallel machine scheduling. Platform: |
Size: 7317504 |
Author:mehdi khanlo |
Hits:
Description: 假设有n个任务由k个可并行工作的机器来完成，完成任务i需要的时间为ti，试设计一个算法找出完成这n个任务的最佳调度，式的完成全部任务的时间最早-Suppose there are n tasks done by the k-th machine can work in parallel, needed to complete the task i time Ti, try to design an algorithm to find the complete optimal scheduling of the n tasks, the task time of the completion of the formula earliest Platform: |
Size: 1024 |
Author:hoticebeg |
Hits:
Description: We consider the scheduling of simple linear deteriorating jobs on parallel machines a new perspective based on game theory. In scheduling, jobs are often controlled by independent and selfish agents, in which each agent tries to a machine for processing that optimizes its own payoff while ignoring the others. We formalize this situation as a game in which the players are job owners, the strategies are machines, and a player’s utility is inversely proportional to the total completion time of the machine selected by the agent. The price of anarchy is the ratio between the worst-case equilibrium makespan and the optimal makespan. In this paper, we design a game theoretic approximation algorithm Aand prove that it converges to a pure-strategy Nash equilibrium in a linear number of rounds. We also derive the upper bound on the price of anarchy of Aand further show that the ratio obtained by Ais tight. Finally, we analyze the time complexity of the proposed algorithm-We consider the scheduling of simple linear deteriorating jobs on parallel machines a new perspective based on game theory. In scheduling, jobs are often controlled by independent and selfish agents, in which each agent tries to a machine for processing that optimizes its own payoff while ignoring the others. We formalize this situation as a game in which the players are job owners, the strategies are machines, and a player’s utility is inversely proportional to the total completion time of the machine selected by the agent. The price of anarchy is the ratio between the worst-case equilibrium makespan and the optimal makespan. In this paper, we design a game theoretic approximation algorithm Aand prove that it converges to a pure-strategy Nash equilibrium in a linear number of rounds. We also derive the upper bound on the price of anarchy of Aand further show that the ratio obtained by Ais tight. Finally, we analyze the time complexity of the proposed algorithm Platform: |
Size: 228352 |
Author:杨松 |
Hits:
Description: We consider the scheduling of simple linear deteriorating jobs on parallel machines a new perspective based on game theory. In scheduling, jobs are often controlled by independent and selfish agents, in which each agent tries to a machine for processing that optimizes its own payoff while ignoring the others. We formalize this situation as a game in which the players are job owners, the strategies are machines, and a player’s utility is inversely proportional to the total completion time of the machine selected by the agent. The price of anarchy is the ratio between the worst-case equilibrium makespan and the optimal makespan. In this paper, we design a game theoretic approximation algorithm Aand prove that it converges to a pure-strategy Nash equilibrium in a linear number of rounds. We also derive the upper bound on the price of anarchy of Aand further show that the ratio obtained by Ais tight. Finally, we analyze the time complexity of the proposed algorithm.-We consider the scheduling of simple linear deteriorating jobs on parallel machines a new perspective based on game theory. In scheduling, jobs are often controlled by independent and selfish agents, in which each agent tries to a machine for processing that optimizes its own payoff while ignoring the others. We formalize this situation as a game in which the players are job owners, the strategies are machines, and a player’s utility is inversely proportional to the total completion time of the machine selected by the agent. The price of anarchy is the ratio between the worst-case equilibrium makespan and the optimal makespan. In this paper, we design a game theoretic approximation algorithm Aand prove that it converges to a pure-strategy Nash equilibrium in a linear number of rounds. We also derive the upper bound on the price of anarchy of Aand further show that the ratio obtained by Ais tight. Finally, we analyze the time complexity of the proposed algorithm. Platform: |
Size: 578560 |
Author:杨松 |
Hits:
Description: Optimal scheduling problem, assuming that n has a mission by the k-parallel machine to complete the work. I need to complete the mission time for ti. Try to design an algorithm to find n complete this task the best scheduling, making the time to complete a full first mission. Platform: |
Size: 174080 |
Author:mojtaba |
Hits:
Search - PARALLEL MACHINE SCHEDULING